An Integrated Machine Vision Based System for Solving the Non - Convex Cutting Stock Problem Using Genetic Algorithms
نویسندگان
چکیده
The two-dimensional stock cutting problem is well known and often studied. A genetic algorithm approach to the problem is developed that is capable of handling some of the more intractable forms of the problem: nonconvex parts; non-convex sheets; multiple irregularly shaped sheets; and so on. An integrated system is developed that incorporates a machine vision module for acquiring the images of irregular (nonconvex) parts and sheets, polygonalizing them and storing them in a database of parts and sheets. Using the polyg-onal images as well as the manufacturing schedules and priorities as input, a genetic algorithm is used to generate part layouts that satisfy the manufacturing constraints. The significant features of this approach are (1) the integration of all aspects of the layout process and (2) the flexibility of the genetic algorithm approach, which allows it to be adapted to fit the special requirements of different problems. The proposed methods can be particularly useful in the leather and apparel industries, where nonconvex parts and sheets are commonly used.
منابع مشابه
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and deve...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملOptimization of Cutting Parameters Based on Production Time Using Colonial Competitive (CC) and Genetic (G) Algorithms
A properly designed machining procedure can significantly affect the efficiency of the production lines. To minimize the cost of machining process as well as increasing the quality of products, cutting parameters must permit the reduction of cutting time and cost to the lowest possible levels. To achieve this, cutting parameters must be kept in the optimal range. This is a non-linear optimizati...
متن کاملSolving a non-convex non-linear optimization problem constrained by fuzzy relational equations and Sugeno-Weber family of t-norms
Sugeno-Weber family of t-norms and t-conorms is one of the most applied one in various fuzzy modelling problems. This family of t-norms and t-conorms was suggested by Weber for modeling intersection and union of fuzzy sets. Also, the t-conorms were suggested as addition rules by Sugeno for so-called $lambda$–fuzzy measures. In this paper, we study a nonlinear optimization problem where the fea...
متن کاملForecasting Stock Market Using Wavelet Transforms and Neural Networks: An integrated system based on Fuzzy Genetic algorithm (Case study of price index of Tehran Stock Exchange)
The jamor purpose of the present research is to predict the total stock market index of Tehran Stock Exchange, using a combined method of Wavelet transforms, Fuzzy genetics, and neural network in order to predict the active participations of finance market as well as macro decision makers.To do so, first the prediction was made by neural network, then a series of price index was decomposed by w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999